Learning to Rank with BERT for Argument Quality Evaluation

نویسندگان

چکیده

The task of argument quality ranking, which identifies the free text arguments, remains, to this day, a challenge. While most state-of-the-art initiatives use point-wise ranking methods and predict an absolute score for each argument, we instead focus on learning how order them by their relative convincingness, experimenting with several learning-to-rank quality. We leverage BERT's powerful ability in building representation paired approaches (point-wise, pairwise, list-wise) rank arguments according measure convincingness. also demonstrate ensemble models trained different losses often improves performance at identifying convincing list. Finally, compare BERT coupled all major datasets available task, demonstrating approach generally performs better outlining topmost arguments.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Effective Learning to Rank Persian Web Content

Persian language is one of the most widely used languages in the Web environment. Hence, the Persian Web includes invaluable information that is required to be retrieved effectively. Similar to other languages, ranking algorithms for the Persian Web content, deal with different challenges, such as applicability issues in real-world situations as well as the lack of user modeling. CF-Rank, as a ...

متن کامل

An argument for rank metric

A protocol is introduced to show an upper bound for rank of a square matrix.

متن کامل

Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists

Verification of a polynomial’s evaluation in a secret committed value plays a role in cryptographic applications such as non-membership or membership proofs. We construct a novel special honest verifier zero-knowledge argument for correct polynomial evaluation. The argument has logarithmic communication cost in the degree of the polynomial, which is a significant improvement over the state of t...

متن کامل

Directly Optimizing Evaluation Measures in Learning to Rank

One of the central issues in learning to rank for information retrieval is to develop algorithms that construct ranking models by directly optimizing evaluation measures used in information retrieval such as Mean Average Precision (MAP) and Normalized Discounted Cumulative Gain (NDCG). Several such algorithms including SVMmap and AdaRank have been proposed and their effectiveness has been verif...

متن کامل

Learning to Rank Cases with Classification Rules

An advantage of rule induction over other machine learning algorithms is the comprehensibility of the models, a requirement for many data mining applications. However, many real life machine learning applications involve the ranking of cases and classification rules are not a good representation for this. There have been numerous studies to incorporate ranking capability into decision trees, bu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ... International Florida Artificial Intelligence Research Society Conference

سال: 2022

ISSN: ['2334-0762', '2334-0754']

DOI: https://doi.org/10.32473/flairs.v35i.130643